n = int(input())
x = []
for i in range(0, n):
m = int(input())
z = input().split()
x.append(z)
for i in range(0, len(x)):
for j in range(0, len(x[i])):
x[i][j] = int(x[i][j])
x[i].sort()
x[i].reverse()
for i in range(0, len(x)):
if len(x[i]) == 1:
if x[i][0]!=1:
print("NO")
else:
print("YES")
elif (x[i][0] - x[i][1]) > 1:
print("NO")
else:
print("YES")#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
long long n,mx=INT_MIN;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
if(arr[i]>mx)
mx=arr[i];
}
if(n==1){
if(arr[0]==1)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
else{
sort(arr,arr+n);
for(int i=n-1;i>=0;i--){
if(arr[i]-arr[i-1]<2){
cout<<"yes"<<endl;
break;
}
else{
cout<<"no"<<endl;
break;
}
}
}
}
}
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |
977A - Wrong Subtraction | 263A - Beautiful Matrix |
180C - Letter | 151A - Soft Drinking |
1352A - Sum of Round Numbers | 281A - Word Capitalization |
1646A - Square Counting | 266A - Stones on the Table |
61A - Ultra-Fast Mathematician | 148A - Insomnia cure |
1650A - Deletions of Two Adjacent Letters | 1512A - Spy Detected |
282A - Bit++ | 69A - Young Physicist |
1651A - Playoff | 734A - Anton and Danik |
1300B - Assigning to Classes | 1647A - Madoka and Math Dad |